package com.leetcode;

/**
 * 136. 只出现一次的数字
 * 位运算
 *
 * @author fy
 * @date 2022/4/18 22:05
 */
public class Solution136_1 {

    public int singleNumber(int[] nums) {
        int single = 0;
        for (int num : nums) {
            single ^= num;
        }
        return single;
    }

}
